Thesis Proposal - Planning Games
نویسنده
چکیده
This paper provides a proposal for a thesis on plan generation in multiagent planning domains with self-interested agents. The research area involves Coalition-Planning Games in which agents are trying to maximise their own utility but can enter into unbreakable deals with other agents. The goal of the research is to provide algorithms for agents to generate plans that form stable solutions.
منابع مشابه
Ph.D. Thesis Proposal: Motion Planning Of Multiple Agents in Virtual Environments
Motion planning has been traditionally studied in the area of robotics. In recent years the techniques are increasingly used in virtual environments and games. In many such applications agents move around and their motion must be planned. We define an agent as anything that can be viewed as perceiving its environment through sensors and acting upon that environment through actuators [1]. This d...
متن کاملPlanification multi-agents dans un cadre markovien : les jeux stochastiques à somme générale
Planning agent’s actions in a dynamic and uncertain environment has been exten-sively studied. The framework of Markov decision process provides tools to model andsolve such problems. The field of game theory has allowed the study of strategic inter-actions between multiple agents for a given game. The framework of stochastic games isconsidered as a generalization of the fields ...
متن کاملEnriching the Legacy of Athens ' 2004 Olympic Village :
The year is 2004. Athens, the capital of Greece is hosting the Olympic Games for the first time in 108 years. Athens, to accommodate the needs of the XXVIII Olympiad, has altered the form of the city through major infrastructure projects. The Olympic Village, as one of these projects, is a place with significant information infrastructure and transformation capabilities that will contribute to ...
متن کاملRobust Planning in Domains with Stochastic Outcomes, Adversaries, and Partial Observability
Real-world planning problems often feature multiple sources of uncertainty, including randomness in outcomes, the presence of adversarial agents, and lack of complete knowledge of the world state. This thesis describes algorithms for four related formal models that can address multiple types of uncertainty: Markov decision processes, MDPs with adversarial costs, extensiveform games, and a new c...
متن کاملAssistant Agents For Sequential Planning Problems
The problem of optimal planning under uncertainty in collaborative multi-agent domains is known to be deeply intractable but still demands a solution. This thesis will explore principled approximation methods that yield tractable approaches to planning for AI assistants, which allow them to understand the intentions of humans and help them achieve their goals. AI assistants are ubiquitous in vi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010